Two special kinds of least squares solutions for the quaternion matrix equation AXB+CXD=E
نویسندگان
چکیده
منابع مشابه
Ela Two Special Kinds of Least Squares Solutions for the Quaternion Matrix Equation
By using the complex representation of quaternion matrices, the Moore–Penrose generalized inverse and the Kronecker product of matrices, the expressions of the least squares η-Hermitian solution with the least norm and the expressions of the least squares η-anti-Hermitian solution with the least norm are derived for the matrix equation AXB+CXD = E over quaternions.
متن کاملIterative solutions to the linear matrix equation AXB + CXTD = E
In this paper the gradient based iterative algorithm is presented to solve the linear matrix equation AXB +CXD = E, where X is unknown matrix, A,B,C,D,E are the given constant matrices. It is proved that if the equation has a solution, then the unique minimum norm solution can be obtained by choosing a special kind of initial matrices. Two numerical examples show that the introduced iterative a...
متن کاملDiagonal and Monomial Solutions of the Matrix Equation AXB=C
In this article, we consider the matrix equation $AXB=C$, where A, B, C are given matrices and give new necessary and sufficient conditions for the existence of the diagonal solutions and monomial solutions to this equation. We also present a general form of such solutions. Moreover, we consider the least squares problem $min_X |C-AXB |_F$ where $X$ is a diagonal or monomial matrix. The explici...
متن کاملIterative solutions to the linear matrix equation
In this paper the gradient based iterative algorithm is presented to solve the linear matrix equation AXB +CXD = E, where X is unknown matrix, A,B,C,D,E are the given constant matrices. It is proved that if the equation has a solution, then the unique minimum norm solution can be obtained by choosing a special kind of initial matrices. Two numerical examples show that the introduced iterative a...
متن کاملIterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
In this paper, by extending the well-known Jacobi and Gauss–Seidel iterations for Ax = b, we study iterative solutions of matrix equations AXB = F and generalized Sylvester matrix equations AXB + CXD = F (including the Sylvester equation AX + XB = F as a special case), and present a gradient based and a least-squares based iterative algorithms for the solution. It is proved that the iterative s...
متن کامل